翻訳と辞書 Words near each other ・ Markoti ・ Markotkh Range ・ Markotów Duży ・ Markotów Mały ・ Markounda ・ Markout, Texas ・ Markov ・ Markov (crater) ・ Markov additive process ・ Markov algorithm ・ Markov blanket ・ Markov brothers' inequality ・ Markov chain ・ Markov chain approximation method ・ Markov chain geostatistics ・ Markov chain mixing time ・ Markov chain Monte Carlo ・ Markov chains on a measurable state space ・ Markov decision process ・ Markov information source ・ Markov kernel ・ Markov logic network ・ Markov model ・ Markov number ・ Markov partition ・ Markov perfect equilibrium ・ Markov process ・ Markov Processes International ・ Markov property ・ Markov random field Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Markov chain mixing time ： ウィキペディア英語版 Markov chain mixing time In probability theory, the mixing time of a Markov chain is the time until the Markov chain is "close" to its steady state distribution. More precisely, a fundamental result about Markov chains is that a finite state irreducible aperiodic chain has a unique stationary distribution ''π'' and, regardless of the initial state, the time-''t'' distribution of the chain converges to ''π'' as ''t'' tends to infinity. Mixing time refers to any of several variant formalizations of the idea: how large must ''t'' be until the time-''t'' distribution is approximately ''π'' ? One variant, ''variation distance mixing time'', is defined as the smallest ''t'' such that :$|\backslash Pr(X\_t\; \backslash in\; A)\; -\; \backslash pi(A)|\; \backslash leq\; 1/4$ for all subsets ''A'' of states and all initial states. This is the sense in which proved that the number of riffle shuffles needed to mix an ordinary 52 card deck is 7. Mathematical theory focuses on how mixing times change as a function of the size of the structure underlying the chain. For an ''n''-card deck, the number of riffle shuffles needed grows as ''1.5 log (n) / log (2)''. The most developed theory concerns randomized algorithms for #P-Complete algorithmic counting problems such as the number of graph colorings of a given ''n'' vertex graph. Such problems can, for sufficiently large number of colors, be answered using the Markov chain Monte Carlo method and showing that the mixing time grows only as ''n log (n)'' . This example and the shuffling example possess the rapid mixing property, that the mixing time grows at most polynomially fast in ''log'' (number of states of the chain). Tools for proving rapid mixing include arguments based on conductance and the method of coupling. In broader uses of the Markov chain Monte Carlo method, rigorous justification of simulation results would require a theoretical bound on mixing time, and many interesting practical cases have resisted such theoretical analysis. == See also== * Mixing (mathematics) for a formal definition of mixing 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Markov chain mixing time」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.